Primitive decompositions of Johnson graphs
نویسندگان
چکیده
منابع مشابه
Primitive decompositions of Johnson graphs
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.
متن کاملHamilton decompositions of graphs with primitive complements
A k-factor of a graph is a k-regular spanning subgraph. A Hamilton cycle is a connected 2-factor. A graph G is said to be primitive if it contains no k-factor with 1 ≤ k < ∆(G). A Hamilton decomposition of a graph G is a partition of the edges of G into sets, each of which induces a Hamilton cycle. In this paper, by using the amalgamation technique, we find necessary and sufficient conditions f...
متن کاملHamilton decompositions of balanced complete multipartite graphs with primitive leaves
A graph G is said to be primitive if it contains no proper factors. In this paper, by using the amalgamation technique, we find sufficient conditions for the existence of a d-regular graph G on n vertices which: 1. has a Hamilton decomposition, and 2. has a complement in K p m that is primitive. These general results are then used to consider the bounds onmwhen p and d are fixed. The case p = 6...
متن کاملShape Control Using Primitive Decompositions
In this paper, we present novel techniques to modify freeform shapes defined by implicit algebraic models. These models are first simplified by introducing a decomposition in terms of conic-line primitives and then the desired local/global shape changes are produced by varying the parameters of these primitives. A decomposed model provides efficient control of each primitive using its canonical...
متن کاملAdditive Decompositions in Primitive Extensions
This paper extends the classical Ostrogradsky–Hermite reduction for rational functions to more general functions in primitive extensions of certain types. For an element f in such an extension K, the extended reduction decomposes f as the sum of a derivative in K and another element r such that f has an antiderivative in K if and only if r = 0; and f has an elementary antiderivative over K if a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2008
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2007.11.005